The greedy algorithm for matroids
نویسندگان
چکیده
منابع مشابه
BASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملOn the rank functions of H-matroids
The notion of H-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of H-matroids by the greedy algorithm. In this note, we give a characterization of some H-matroids by rank functions. 2010 MSC: 05B35, 90C27
متن کاملThe greedy algorithm for strict cg-matroids
A matroid-like structure defined on a convex geometry, called a cg-matroid, is defined by S. Fujishige, G. A. Koshevoy, and Y. Sano in [6]. Strict cg-matroids are the special subclass of cg-matroids. In this paper, we show that the greedy algorithm works for strict cg-matroids with natural weightings, and also show that the greedy algorithm works for a hereditary system on a convex geometry wit...
متن کاملNeighbor Systems and the Greedy Algorithm ( Extended
A neighbor system, introduced in this paper, is a collection of integral vectors in R with some special structure. Such collections (slightly) generalize jump systems, which, in turn, generalize integral bisubmodular polyhedra, integral polymatroids, delta-matroids, matroids, and other structures. We show that neighbor systems provide a systematic and simple way to characterize these structures...
متن کاملIntroduction to Combinatorial Optimization in Matroids
1. Matroids and Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1 2. Greedy Algorithm and Matroids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .13 3. Duality, Minors and Constructions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملA general model for matroids and the greedy algorithm
We present a general model for set systems to be independence families with respect to set families which determine classes of proper weight functions on a ground set. Within this model, matroids arise from a natural subclass and can be characterized by the optimality of the greedy algorithm. This model includes and extends many of the models for generalized matroid-type greedy algorithms propo...
متن کامل